TSTP Solution File: ALG018^7 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : ALG018^7 : TPTP v8.1.2. Released v5.5.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 30 16:07:53 EDT 2023
% Result : Timeout 299.82s 300.06s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ALG018^7 : TPTP v8.1.2. Released v5.5.0.
% 0.06/0.13 % Command : do_cvc5 %s %d
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Aug 28 03:25:35 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.18/0.46 %----Proving TH0
% 0.18/0.47 %------------------------------------------------------------------------------
% 0.18/0.47 % File : ALG018^7 : TPTP v8.1.2. Released v5.5.0.
% 0.18/0.47 % Domain : General Algebra
% 0.18/0.47 % Problem : Groups 4: CPROPS-SORTED-DISCRIMINANT-PROBLEM-1
% 0.18/0.47 % Version : [Ben12] axioms.
% 0.18/0.47 % English :
% 0.18/0.47
% 0.18/0.47 % Refs : [Goe69] Goedel (1969), An Interpretation of the Intuitionistic
% 0.18/0.47 % : [CM+04] Colton et al. (2004), Automatic Generation of Classifi
% 0.18/0.47 % : [Ben12] Benzmueller (2012), Email to Geoff Sutcliffe
% 0.18/0.47 % Source : [Ben12]
% 0.18/0.47 % Names : s4-cumul-GAL018+1 [Ben12]
% 0.18/0.47
% 0.18/0.47 % Status : Theorem
% 0.18/0.47 % Rating : 1.00 v5.5.0
% 0.18/0.47 % Syntax : Number of formulae : 98 ( 37 unt; 42 typ; 32 def)
% 0.18/0.47 % Number of atoms : 371 ( 36 equ; 0 cnn)
% 0.18/0.47 % Maximal formula atoms : 69 ( 6 avg)
% 0.18/0.47 % Number of connectives : 529 ( 5 ~; 5 |; 9 &; 500 @)
% 0.18/0.47 % ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% 0.18/0.47 % Maximal formula depth : 25 ( 6 avg)
% 0.18/0.47 % Number of types : 3 ( 1 usr)
% 0.18/0.47 % Number of type conns : 190 ( 190 >; 0 *; 0 +; 0 <<)
% 0.18/0.47 % Number of symbols : 52 ( 50 usr; 10 con; 0-3 aty)
% 0.18/0.47 % Number of variables : 142 ( 91 ^; 44 !; 7 ?; 142 :)
% 0.18/0.47 % SPC : TH0_THM_EQU_NAR
% 0.18/0.47
% 0.18/0.47 % Comments : Goedel translation of ALG018+1
% 0.18/0.47 %------------------------------------------------------------------------------
% 0.18/0.47 %----Include axioms for Modal logic S4 under cumulative domains
% 0.18/0.47 %------------------------------------------------------------------------------
% 0.18/0.47 %----Declaration of additional base type mu
% 0.18/0.47 thf(mu_type,type,
% 0.18/0.47 mu: $tType ).
% 0.18/0.47
% 0.18/0.47 %----Equality
% 0.18/0.47 thf(qmltpeq_type,type,
% 0.18/0.47 qmltpeq: mu > mu > $i > $o ).
% 0.18/0.47
% 0.18/0.47 % originale Definition
% 0.18/0.47 %thf(qmltpeq,definition,
% 0.18/0.47 % ( qmltpeq
% 0.18/0.47 % = ( ^ [X: mu,Y: mu,W: $i] : ( X = Y ) ) )).
% 0.18/0.47
% 0.18/0.47 % erweiterte Leibnitz-Definition
% 0.18/0.47 %thf(qmltpeq,definition,
% 0.18/0.47 % ( qmltpeq
% 0.18/0.47 % = ( ^ [X: mu,Y: mu,W: $i] : (![P: mu > $i > $o]: ( (P @ X @ W) <=> (P @ Y @ W) ) ) ) )).
% 0.18/0.47
% 0.18/0.47 % Leibnitz-Definition
% 0.18/0.47 %thf(qmltpeq,definition,
% 0.18/0.47 % ( qmltpeq
% 0.18/0.47 % = ( ^ [X: mu,Y: mu,W: $i] : (! [P: mu > $o]: ( (P @ X) <=> (P @ Y) ) ) ) )).
% 0.18/0.47
% 0.18/0.47 thf(meq_prop_type,type,
% 0.18/0.47 meq_prop: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.18/0.47
% 0.18/0.47 thf(meq_prop,definition,
% 0.18/0.47 ( meq_prop
% 0.18/0.47 = ( ^ [X: $i > $o,Y: $i > $o,W: $i] :
% 0.18/0.47 ( ( X @ W )
% 0.18/0.47 = ( Y @ W ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 %----Modal operators not, or, box, Pi
% 0.18/0.47 thf(mnot_type,type,
% 0.18/0.47 mnot: ( $i > $o ) > $i > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mnot,definition,
% 0.18/0.47 ( mnot
% 0.18/0.47 = ( ^ [Phi: $i > $o,W: $i] :
% 0.18/0.47 ~ ( Phi @ W ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(mor_type,type,
% 0.18/0.47 mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mor,definition,
% 0.18/0.47 ( mor
% 0.18/0.47 = ( ^ [Phi: $i > $o,Psi: $i > $o,W: $i] :
% 0.18/0.47 ( ( Phi @ W )
% 0.18/0.47 | ( Psi @ W ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(mbox_type,type,
% 0.18/0.47 mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mbox,definition,
% 0.18/0.47 ( mbox
% 0.18/0.47 = ( ^ [R: $i > $i > $o,Phi: $i > $o,W: $i] :
% 0.18/0.47 ! [V: $i] :
% 0.18/0.47 ( ~ ( R @ W @ V )
% 0.18/0.47 | ( Phi @ V ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(mforall_prop_type,type,
% 0.18/0.47 mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mforall_prop,definition,
% 0.18/0.47 ( mforall_prop
% 0.18/0.47 = ( ^ [Phi: ( $i > $o ) > $i > $o,W: $i] :
% 0.18/0.47 ! [P: $i > $o] : ( Phi @ P @ W ) ) ) ).
% 0.18/0.47
% 0.18/0.47 %----Further modal operators
% 0.18/0.47 thf(mtrue_type,type,
% 0.18/0.47 mtrue: $i > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mtrue,definition,
% 0.18/0.47 ( mtrue
% 0.18/0.47 = ( ^ [W: $i] : $true ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(mfalse_type,type,
% 0.18/0.47 mfalse: $i > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mfalse,definition,
% 0.18/0.47 ( mfalse
% 0.18/0.47 = ( mnot @ mtrue ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(mand_type,type,
% 0.18/0.47 mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mand,definition,
% 0.18/0.47 ( mand
% 0.18/0.47 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mnot @ ( mor @ ( mnot @ Phi ) @ ( mnot @ Psi ) ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(mimplies_type,type,
% 0.18/0.47 mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mimplies,definition,
% 0.18/0.47 ( mimplies
% 0.18/0.47 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mor @ ( mnot @ Phi ) @ Psi ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(mimplied_type,type,
% 0.18/0.47 mimplied: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mimplied,definition,
% 0.18/0.47 ( mimplied
% 0.18/0.47 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mor @ ( mnot @ Psi ) @ Phi ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(mequiv_type,type,
% 0.18/0.47 mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mequiv,definition,
% 0.18/0.47 ( mequiv
% 0.18/0.47 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mand @ ( mimplies @ Phi @ Psi ) @ ( mimplies @ Psi @ Phi ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(mxor_type,type,
% 0.18/0.47 mxor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mxor,definition,
% 0.18/0.47 ( mxor
% 0.18/0.47 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mnot @ ( mequiv @ Phi @ Psi ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(mdia_type,type,
% 0.18/0.47 mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mdia,definition,
% 0.18/0.47 ( mdia
% 0.18/0.47 = ( ^ [R: $i > $i > $o,Phi: $i > $o] : ( mnot @ ( mbox @ R @ ( mnot @ Phi ) ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 %--- (new for cumulative)
% 0.18/0.47 %---Declaration of existence predicate for simulating cumulative domain
% 0.18/0.47 thf(exists_in_world_type,type,
% 0.18/0.47 exists_in_world: mu > $i > $o ).
% 0.18/0.47
% 0.18/0.47 %----The domains are non-empty
% 0.18/0.47 thf(nonempty_ax,axiom,
% 0.18/0.47 ! [V: $i] :
% 0.18/0.47 ? [X: mu] : ( exists_in_world @ X @ V ) ).
% 0.18/0.47
% 0.18/0.47 thf(mforall_ind_type,type,
% 0.18/0.47 mforall_ind: ( mu > $i > $o ) > $i > $o ).
% 0.18/0.47
% 0.18/0.47 %--- (new for cumulative)
% 0.18/0.47 thf(mforall_ind,definition,
% 0.18/0.47 ( mforall_ind
% 0.18/0.47 = ( ^ [Phi: mu > $i > $o,W: $i] :
% 0.18/0.47 ! [X: mu] :
% 0.18/0.47 ( ( exists_in_world @ X @ W )
% 0.18/0.47 => ( Phi @ X @ W ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 %thf(mforall_ind,definition,
% 0.18/0.47 % ( mforall_ind
% 0.18/0.47 % = ( ^ [Phi: mu > $i > $o,W: $i] :
% 0.18/0.47 % ! [X: mu] :
% 0.18/0.47 % ( Phi @ X @ W ) ) )).
% 0.18/0.47
% 0.18/0.47 thf(mexists_ind_type,type,
% 0.18/0.47 mexists_ind: ( mu > $i > $o ) > $i > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mexists_ind,definition,
% 0.18/0.47 ( mexists_ind
% 0.18/0.47 = ( ^ [Phi: mu > $i > $o] :
% 0.18/0.47 ( mnot
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [X: mu] : ( mnot @ ( Phi @ X ) ) ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(mexists_prop_type,type,
% 0.18/0.47 mexists_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mexists_prop,definition,
% 0.18/0.47 ( mexists_prop
% 0.18/0.47 = ( ^ [Phi: ( $i > $o ) > $i > $o] :
% 0.18/0.47 ( mnot
% 0.18/0.47 @ ( mforall_prop
% 0.18/0.47 @ ^ [P: $i > $o] : ( mnot @ ( Phi @ P ) ) ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 %----Definition of properties of accessibility relations
% 0.18/0.47 thf(mreflexive_type,type,
% 0.18/0.47 mreflexive: ( $i > $i > $o ) > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mreflexive,definition,
% 0.18/0.47 ( mreflexive
% 0.18/0.47 = ( ^ [R: $i > $i > $o] :
% 0.18/0.47 ! [S: $i] : ( R @ S @ S ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(msymmetric_type,type,
% 0.18/0.47 msymmetric: ( $i > $i > $o ) > $o ).
% 0.18/0.47
% 0.18/0.47 thf(msymmetric,definition,
% 0.18/0.47 ( msymmetric
% 0.18/0.47 = ( ^ [R: $i > $i > $o] :
% 0.18/0.47 ! [S: $i,T: $i] :
% 0.18/0.47 ( ( R @ S @ T )
% 0.18/0.47 => ( R @ T @ S ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(mserial_type,type,
% 0.18/0.47 mserial: ( $i > $i > $o ) > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mserial,definition,
% 0.18/0.47 ( mserial
% 0.18/0.47 = ( ^ [R: $i > $i > $o] :
% 0.18/0.47 ! [S: $i] :
% 0.18/0.47 ? [T: $i] : ( R @ S @ T ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(mtransitive_type,type,
% 0.18/0.47 mtransitive: ( $i > $i > $o ) > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mtransitive,definition,
% 0.18/0.47 ( mtransitive
% 0.18/0.47 = ( ^ [R: $i > $i > $o] :
% 0.18/0.47 ! [S: $i,T: $i,U: $i] :
% 0.18/0.47 ( ( ( R @ S @ T )
% 0.18/0.47 & ( R @ T @ U ) )
% 0.18/0.47 => ( R @ S @ U ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(meuclidean_type,type,
% 0.18/0.47 meuclidean: ( $i > $i > $o ) > $o ).
% 0.18/0.47
% 0.18/0.47 thf(meuclidean,definition,
% 0.18/0.47 ( meuclidean
% 0.18/0.47 = ( ^ [R: $i > $i > $o] :
% 0.18/0.47 ! [S: $i,T: $i,U: $i] :
% 0.18/0.47 ( ( ( R @ S @ T )
% 0.18/0.47 & ( R @ S @ U ) )
% 0.18/0.47 => ( R @ T @ U ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(mpartially_functional_type,type,
% 0.18/0.47 mpartially_functional: ( $i > $i > $o ) > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mpartially_functional,definition,
% 0.18/0.47 ( mpartially_functional
% 0.18/0.47 = ( ^ [R: $i > $i > $o] :
% 0.18/0.47 ! [S: $i,T: $i,U: $i] :
% 0.18/0.47 ( ( ( R @ S @ T )
% 0.18/0.47 & ( R @ S @ U ) )
% 0.18/0.47 => ( T = U ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(mfunctional_type,type,
% 0.18/0.47 mfunctional: ( $i > $i > $o ) > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mfunctional,definition,
% 0.18/0.47 ( mfunctional
% 0.18/0.47 = ( ^ [R: $i > $i > $o] :
% 0.18/0.47 ! [S: $i] :
% 0.18/0.47 ? [T: $i] :
% 0.18/0.47 ( ( R @ S @ T )
% 0.18/0.47 & ! [U: $i] :
% 0.18/0.47 ( ( R @ S @ U )
% 0.18/0.47 => ( T = U ) ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(mweakly_dense_type,type,
% 0.18/0.47 mweakly_dense: ( $i > $i > $o ) > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mweakly_dense,definition,
% 0.18/0.47 ( mweakly_dense
% 0.18/0.47 = ( ^ [R: $i > $i > $o] :
% 0.18/0.47 ! [S: $i,T: $i,U: $i] :
% 0.18/0.47 ( ( R @ S @ T )
% 0.18/0.47 => ? [U: $i] :
% 0.18/0.47 ( ( R @ S @ U )
% 0.18/0.47 & ( R @ U @ T ) ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(mweakly_connected_type,type,
% 0.18/0.47 mweakly_connected: ( $i > $i > $o ) > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mweakly_connected,definition,
% 0.18/0.47 ( mweakly_connected
% 0.18/0.47 = ( ^ [R: $i > $i > $o] :
% 0.18/0.47 ! [S: $i,T: $i,U: $i] :
% 0.18/0.47 ( ( ( R @ S @ T )
% 0.18/0.47 & ( R @ S @ U ) )
% 0.18/0.47 => ( ( R @ T @ U )
% 0.18/0.47 | ( T = U )
% 0.18/0.47 | ( R @ U @ T ) ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(mweakly_directed_type,type,
% 0.18/0.47 mweakly_directed: ( $i > $i > $o ) > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mweakly_directed,definition,
% 0.18/0.47 ( mweakly_directed
% 0.18/0.47 = ( ^ [R: $i > $i > $o] :
% 0.18/0.47 ! [S: $i,T: $i,U: $i] :
% 0.18/0.47 ( ( ( R @ S @ T )
% 0.18/0.47 & ( R @ S @ U ) )
% 0.18/0.47 => ? [V: $i] :
% 0.18/0.47 ( ( R @ T @ V )
% 0.18/0.47 & ( R @ U @ V ) ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 %----Definition of validity
% 0.18/0.47 thf(mvalid_type,type,
% 0.18/0.47 mvalid: ( $i > $o ) > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mvalid,definition,
% 0.18/0.47 ( mvalid
% 0.18/0.47 = ( ^ [Phi: $i > $o] :
% 0.18/0.47 ! [W: $i] : ( Phi @ W ) ) ) ).
% 0.18/0.47
% 0.18/0.47 %----Definition of satisfiability
% 0.18/0.47 thf(msatisfiable_type,type,
% 0.18/0.47 msatisfiable: ( $i > $o ) > $o ).
% 0.18/0.47
% 0.18/0.47 thf(msatisfiable,definition,
% 0.18/0.47 ( msatisfiable
% 0.18/0.47 = ( ^ [Phi: $i > $o] :
% 0.18/0.47 ? [W: $i] : ( Phi @ W ) ) ) ).
% 0.18/0.47
% 0.18/0.47 %----Definition of countersatisfiability
% 0.18/0.47 thf(mcountersatisfiable_type,type,
% 0.18/0.47 mcountersatisfiable: ( $i > $o ) > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mcountersatisfiable,definition,
% 0.18/0.47 ( mcountersatisfiable
% 0.18/0.47 = ( ^ [Phi: $i > $o] :
% 0.18/0.47 ? [W: $i] :
% 0.18/0.47 ~ ( Phi @ W ) ) ) ).
% 0.18/0.47
% 0.18/0.47 %----Definition of invalidity
% 0.18/0.47 thf(minvalid_type,type,
% 0.18/0.47 minvalid: ( $i > $o ) > $o ).
% 0.18/0.47
% 0.18/0.47 thf(minvalid,definition,
% 0.18/0.47 ( minvalid
% 0.18/0.47 = ( ^ [Phi: $i > $o] :
% 0.18/0.47 ! [W: $i] :
% 0.18/0.47 ~ ( Phi @ W ) ) ) ).
% 0.18/0.47
% 0.18/0.47 %------------------------------------------------------------------------------
% 0.18/0.47 %------------------------------------------------------------------------------
% 0.18/0.47 %----We reserve an accessibility relation constant rel_s4
% 0.18/0.47 thf(rel_s4_type,type,
% 0.18/0.47 rel_s4: $i > $i > $o ).
% 0.18/0.47
% 0.18/0.47 %----We define mbox_s4 and mdia_s4 based on rel_s4
% 0.18/0.47 thf(mbox_s4_type,type,
% 0.18/0.47 mbox_s4: ( $i > $o ) > $i > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mbox_s4,definition,
% 0.18/0.47 ( mbox_s4
% 0.18/0.47 = ( ^ [Phi: $i > $o,W: $i] :
% 0.18/0.47 ! [V: $i] :
% 0.18/0.47 ( ~ ( rel_s4 @ W @ V )
% 0.18/0.47 | ( Phi @ V ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(mdia_s4_type,type,
% 0.18/0.47 mdia_s4: ( $i > $o ) > $i > $o ).
% 0.18/0.47
% 0.18/0.47 thf(mdia_s4,definition,
% 0.18/0.47 ( mdia_s4
% 0.18/0.47 = ( ^ [Phi: $i > $o] : ( mnot @ ( mbox_s4 @ ( mnot @ Phi ) ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 %----We have now two options for stating the B conditions:
% 0.18/0.47 %----We can (i) directly formulate conditions for the accessibility relation
% 0.18/0.47 %----constant or we can (ii) state corresponding axioms. We here prefer (i)
% 0.18/0.47 thf(a1,axiom,
% 0.18/0.47 mreflexive @ rel_s4 ).
% 0.18/0.47
% 0.18/0.47 thf(a2,axiom,
% 0.18/0.47 mtransitive @ rel_s4 ).
% 0.18/0.47
% 0.18/0.47 %------------------------------------------------------------------------------
% 0.18/0.47 %------------------------------------------------------------------------------
% 0.18/0.47 thf(cumulative_ax,axiom,
% 0.18/0.47 ! [X: mu,V: $i,W: $i] :
% 0.18/0.47 ( ( ( exists_in_world @ X @ V )
% 0.18/0.47 & ( rel_s4 @ V @ W ) )
% 0.18/0.47 => ( exists_in_world @ X @ W ) ) ).
% 0.18/0.47
% 0.18/0.47 %------------------------------------------------------------------------------
% 0.18/0.47 %------------------------------------------------------------------------------
% 0.18/0.47 thf(sorti2_type,type,
% 0.18/0.47 sorti2: mu > $i > $o ).
% 0.18/0.47
% 0.18/0.47 thf(sorti1_type,type,
% 0.18/0.47 sorti1: mu > $i > $o ).
% 0.18/0.47
% 0.18/0.47 thf(op2_type,type,
% 0.18/0.47 op2: mu > mu > mu ).
% 0.18/0.47
% 0.18/0.47 thf(existence_of_op2_ax,axiom,
% 0.18/0.47 ! [V: $i,V2: mu,V1: mu] : ( exists_in_world @ ( op2 @ V2 @ V1 ) @ V ) ).
% 0.18/0.47
% 0.18/0.47 thf(op1_type,type,
% 0.18/0.47 op1: mu > mu > mu ).
% 0.18/0.47
% 0.18/0.47 thf(existence_of_op1_ax,axiom,
% 0.18/0.47 ! [V: $i,V2: mu,V1: mu] : ( exists_in_world @ ( op1 @ V2 @ V1 ) @ V ) ).
% 0.18/0.47
% 0.18/0.47 thf(j_type,type,
% 0.18/0.47 j: mu > mu ).
% 0.18/0.47
% 0.18/0.47 thf(existence_of_j_ax,axiom,
% 0.18/0.47 ! [V: $i,V1: mu] : ( exists_in_world @ ( j @ V1 ) @ V ) ).
% 0.18/0.47
% 0.18/0.47 thf(h_type,type,
% 0.18/0.47 h: mu > mu ).
% 0.18/0.47
% 0.18/0.47 thf(existence_of_h_ax,axiom,
% 0.18/0.47 ! [V: $i,V1: mu] : ( exists_in_world @ ( h @ V1 ) @ V ) ).
% 0.18/0.47
% 0.18/0.47 thf(reflexivity,axiom,
% 0.18/0.47 ( mvalid
% 0.18/0.47 @ ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [X: mu] : ( mbox_s4 @ ( qmltpeq @ X @ X ) ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(symmetry,axiom,
% 0.18/0.47 ( mvalid
% 0.18/0.47 @ ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [X: mu] :
% 0.18/0.47 ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [Y: mu] : ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( qmltpeq @ X @ Y ) ) @ ( mbox_s4 @ ( qmltpeq @ Y @ X ) ) ) ) ) ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(transitivity,axiom,
% 0.18/0.47 ( mvalid
% 0.18/0.47 @ ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [X: mu] :
% 0.18/0.47 ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [Y: mu] :
% 0.18/0.47 ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [Z: mu] : ( mbox_s4 @ ( mimplies @ ( mand @ ( mbox_s4 @ ( qmltpeq @ X @ Y ) ) @ ( mbox_s4 @ ( qmltpeq @ Y @ Z ) ) ) @ ( mbox_s4 @ ( qmltpeq @ X @ Z ) ) ) ) ) ) ) ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(h_substitution_1,axiom,
% 0.18/0.47 ( mvalid
% 0.18/0.47 @ ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [A: mu] :
% 0.18/0.47 ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [B: mu] : ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( qmltpeq @ A @ B ) ) @ ( mbox_s4 @ ( qmltpeq @ ( h @ A ) @ ( h @ B ) ) ) ) ) ) ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(j_substitution_1,axiom,
% 0.18/0.47 ( mvalid
% 0.18/0.47 @ ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [A: mu] :
% 0.18/0.47 ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [B: mu] : ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( qmltpeq @ A @ B ) ) @ ( mbox_s4 @ ( qmltpeq @ ( j @ A ) @ ( j @ B ) ) ) ) ) ) ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(op1_substitution_1,axiom,
% 0.18/0.47 ( mvalid
% 0.18/0.47 @ ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [A: mu] :
% 0.18/0.47 ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [B: mu] :
% 0.18/0.47 ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [C: mu] : ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( qmltpeq @ A @ B ) ) @ ( mbox_s4 @ ( qmltpeq @ ( op1 @ A @ C ) @ ( op1 @ B @ C ) ) ) ) ) ) ) ) ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(op1_substitution_2,axiom,
% 0.18/0.47 ( mvalid
% 0.18/0.47 @ ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [A: mu] :
% 0.18/0.47 ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [B: mu] :
% 0.18/0.47 ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [C: mu] : ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( qmltpeq @ A @ B ) ) @ ( mbox_s4 @ ( qmltpeq @ ( op1 @ C @ A ) @ ( op1 @ C @ B ) ) ) ) ) ) ) ) ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(op2_substitution_1,axiom,
% 0.18/0.47 ( mvalid
% 0.18/0.47 @ ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [A: mu] :
% 0.18/0.47 ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [B: mu] :
% 0.18/0.47 ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [C: mu] : ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( qmltpeq @ A @ B ) ) @ ( mbox_s4 @ ( qmltpeq @ ( op2 @ A @ C ) @ ( op2 @ B @ C ) ) ) ) ) ) ) ) ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(op2_substitution_2,axiom,
% 0.18/0.47 ( mvalid
% 0.18/0.47 @ ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [A: mu] :
% 0.18/0.47 ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [B: mu] :
% 0.18/0.47 ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [C: mu] : ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( qmltpeq @ A @ B ) ) @ ( mbox_s4 @ ( qmltpeq @ ( op2 @ C @ A ) @ ( op2 @ C @ B ) ) ) ) ) ) ) ) ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(sorti1_substitution_1,axiom,
% 0.18/0.47 ( mvalid
% 0.18/0.47 @ ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [A: mu] :
% 0.18/0.47 ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [B: mu] : ( mbox_s4 @ ( mimplies @ ( mand @ ( mbox_s4 @ ( qmltpeq @ A @ B ) ) @ ( mbox_s4 @ ( sorti1 @ A ) ) ) @ ( mbox_s4 @ ( sorti1 @ B ) ) ) ) ) ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(sorti2_substitution_1,axiom,
% 0.18/0.47 ( mvalid
% 0.18/0.47 @ ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [A: mu] :
% 0.18/0.47 ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [B: mu] : ( mbox_s4 @ ( mimplies @ ( mand @ ( mbox_s4 @ ( qmltpeq @ A @ B ) ) @ ( mbox_s4 @ ( sorti2 @ A ) ) ) @ ( mbox_s4 @ ( sorti2 @ B ) ) ) ) ) ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(ax1,axiom,
% 0.18/0.47 ( mvalid
% 0.18/0.47 @ ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [U: mu] :
% 0.18/0.47 ( mbox_s4
% 0.18/0.47 @ ( mimplies @ ( mbox_s4 @ ( sorti1 @ U ) )
% 0.18/0.47 @ ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [V: mu] : ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( sorti1 @ V ) ) @ ( mbox_s4 @ ( sorti1 @ ( op1 @ U @ V ) ) ) ) ) ) ) ) ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(ax2,axiom,
% 0.18/0.47 ( mvalid
% 0.18/0.47 @ ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [U: mu] :
% 0.18/0.47 ( mbox_s4
% 0.18/0.47 @ ( mimplies @ ( mbox_s4 @ ( sorti2 @ U ) )
% 0.18/0.47 @ ( mbox_s4
% 0.18/0.47 @ ( mforall_ind
% 0.18/0.47 @ ^ [V: mu] : ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( sorti2 @ V ) ) @ ( mbox_s4 @ ( sorti2 @ ( op2 @ U @ V ) ) ) ) ) ) ) ) ) ) ) ) ).
% 0.18/0.47
% 0.18/0.47 thf(ax3,axiom,
% 0.18/0.49 ( mvalid
% 0.18/0.49 @ ( mexists_ind
% 0.18/0.49 @ ^ [U: mu] :
% 0.18/0.49 ( mand @ ( mbox_s4 @ ( sorti1 @ U ) )
% 0.18/0.49 @ ( mbox_s4
% 0.18/0.49 @ ( mforall_ind
% 0.18/0.49 @ ^ [V: mu] : ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( sorti1 @ V ) ) @ ( mbox_s4 @ ( qmltpeq @ ( op1 @ V @ V ) @ U ) ) ) ) ) ) ) ) ) ).
% 0.18/0.49
% 0.18/0.49 thf(ax4,axiom,
% 0.18/0.49 ( mvalid
% 0.18/0.49 @ ( mbox_s4
% 0.18/0.49 @ ( mnot
% 0.18/0.49 @ ( mexists_ind
% 0.18/0.49 @ ^ [U: mu] :
% 0.18/0.49 ( mand @ ( mbox_s4 @ ( sorti2 @ U ) )
% 0.18/0.49 @ ( mbox_s4
% 0.18/0.49 @ ( mforall_ind
% 0.18/0.49 @ ^ [V: mu] : ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( sorti2 @ V ) ) @ ( mbox_s4 @ ( qmltpeq @ ( op2 @ V @ V ) @ U ) ) ) ) ) ) ) ) ) ) ) ).
% 0.18/0.49
% 0.18/0.49 thf(co1,conjecture,
% 0.18/0.49 ( mvalid
% 0.18/0.49 @ ( mbox_s4
% 0.18/0.49 @ ( mimplies
% 0.18/0.49 @ ( mand
% 0.18/0.49 @ ( mbox_s4
% 0.18/0.49 @ ( mforall_ind
% 0.18/0.49 @ ^ [U: mu] : ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( sorti1 @ U ) ) @ ( mbox_s4 @ ( sorti2 @ ( h @ U ) ) ) ) ) ) )
% 0.18/0.49 @ ( mbox_s4
% 0.18/0.49 @ ( mforall_ind
% 0.18/0.49 @ ^ [V: mu] : ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( sorti2 @ V ) ) @ ( mbox_s4 @ ( sorti1 @ ( j @ V ) ) ) ) ) ) ) )
% 0.18/0.49 @ ( mbox_s4
% 0.18/0.49 @ ( mnot
% 0.18/0.49 @ ( mand
% 0.18/0.49 @ ( mbox_s4
% 0.18/0.49 @ ( mforall_ind
% 0.18/0.49 @ ^ [W: mu] :
% 0.18/0.49 ( mbox_s4
% 0.18/0.49 @ ( mimplies @ ( mbox_s4 @ ( sorti1 @ W ) )
% 0.18/0.49 @ ( mbox_s4
% 0.18/0.49 @ ( mforall_ind
% 0.18/0.49 @ ^ [X: mu] : ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( sorti1 @ X ) ) @ ( mbox_s4 @ ( qmltpeq @ ( h @ ( op1 @ W @ X ) ) @ ( op2 @ ( h @ W ) @ ( h @ X ) ) ) ) ) ) ) ) ) ) ) )
% 0.18/0.49 @ ( mand
% 0.18/0.49 @ ( mbox_s4
% 0.18/0.49 @ ( mforall_ind
% 0.18/0.49 @ ^ [Y: mu] :
% 0.18/0.49 ( mbox_s4
% 0.18/0.49 @ ( mimplies @ ( mbox_s4 @ ( sorti2 @ Y ) )
% 0.18/0.49 @ ( mbox_s4
% 0.18/0.49 @ ( mforall_ind
% 0.18/0.49 @ ^ [Z: mu] : ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( sorti2 @ Z ) ) @ ( mbox_s4 @ ( qmltpeq @ ( j @ ( op2 @ Y @ Z ) ) @ ( op1 @ ( j @ Y ) @ ( j @ Z ) ) ) ) ) ) ) ) ) ) ) )
% 0.18/0.49 @ ( mand
% 0.18/0.49 @ ( mbox_s4
% 0.18/0.49 @ ( mforall_ind
% 0.18/0.49 @ ^ [X1: mu] : ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( sorti2 @ X1 ) ) @ ( mbox_s4 @ ( qmltpeq @ ( h @ ( j @ X1 ) ) @ X1 ) ) ) ) ) )
% 0.18/0.49 @ ( mbox_s4
% 0.18/0.49 @ ( mforall_ind
% 0.18/0.49 @ ^ [X2: mu] : ( mbox_s4 @ ( mimplies @ ( mbox_s4 @ ( sorti1 @ X2 ) ) @ ( mbox_s4 @ ( qmltpeq @ ( j @ ( h @ X2 ) ) @ X2 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ).
% 0.18/0.49
% 0.18/0.49 %------------------------------------------------------------------------------
% 0.18/0.49 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.hIDMmKFbho/cvc5---1.0.5_2518.p...
% 0.18/0.49 (declare-sort $$unsorted 0)
% 0.18/0.49 (declare-sort tptp.mu 0)
% 0.18/0.49 (declare-fun tptp.qmltpeq (tptp.mu tptp.mu $$unsorted) Bool)
% 0.18/0.49 (declare-fun tptp.meq_prop ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.18/0.49 (assert (= tptp.meq_prop (lambda ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool)) (W $$unsorted)) (= (@ X W) (@ Y W)))))
% 0.18/0.49 (declare-fun tptp.mnot ((-> $$unsorted Bool) $$unsorted) Bool)
% 0.18/0.49 (assert (= tptp.mnot (lambda ((Phi (-> $$unsorted Bool)) (W $$unsorted)) (not (@ Phi W)))))
% 0.18/0.49 (declare-fun tptp.mor ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.18/0.49 (assert (= tptp.mor (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (W $$unsorted)) (or (@ Phi W) (@ Psi W)))))
% 0.18/0.49 (declare-fun tptp.mbox ((-> $$unsorted $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.18/0.49 (assert (= tptp.mbox (lambda ((R (-> $$unsorted $$unsorted Bool)) (Phi (-> $$unsorted Bool)) (W $$unsorted)) (forall ((V $$unsorted)) (or (not (@ (@ R W) V)) (@ Phi V))))))
% 0.18/0.49 (declare-fun tptp.mforall_prop ((-> (-> $$unsorted Bool) $$unsorted Bool) $$unsorted) Bool)
% 0.18/0.49 (assert (= tptp.mforall_prop (lambda ((Phi (-> (-> $$unsorted Bool) $$unsorted Bool)) (W $$unsorted)) (forall ((P (-> $$unsorted Bool))) (@ (@ Phi P) W)))))
% 0.18/0.49 (declare-fun tptp.mtrue ($$unsorted) Bool)
% 0.18/0.49 (assert (= tptp.mtrue (lambda ((W $$unsorted)) true)))
% 0.18/0.49 (declare-fun tptp.mfalse ($$unsorted) Bool)
% 0.18/0.49 (assert (= tptp.mfalse (@ tptp.mnot tptp.mtrue)))
% 0.18/0.49 (declare-fun tptp.mand ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.18/0.49 (assert (= tptp.mand (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ (@ tptp.mor (@ tptp.mnot Phi)) (@ tptp.mnot Psi))) __flatten_var_0))))
% 0.18/0.49 (declare-fun tptp.mimplies ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.18/0.49 (assert (= tptp.mimplies (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mor (@ tptp.mnot Phi)) Psi) __flatten_var_0))))
% 0.18/0.49 (declare-fun tptp.mimplied ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.18/0.49 (assert (= tptp.mimplied (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mor (@ tptp.mnot Psi)) Phi) __flatten_var_0))))
% 0.18/0.49 (declare-fun tptp.mequiv ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.18/0.49 (assert (= tptp.mequiv (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mand (@ (@ tptp.mimplies Phi) Psi)) (@ (@ tptp.mimplies Psi) Phi)) __flatten_var_0))))
% 0.18/0.49 (declare-fun tptp.mxor ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.18/0.49 (assert (= tptp.mxor (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ (@ tptp.mequiv Phi) Psi)) __flatten_var_0))))
% 0.18/0.49 (declare-fun tptp.mdia ((-> $$unsorted $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.18/0.49 (assert (= tptp.mdia (lambda ((R (-> $$unsorted $$unsorted Bool)) (Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ (@ tptp.mbox R) (@ tptp.mnot Phi))) __flatten_var_0))))
% 0.18/0.49 (declare-fun tptp.exists_in_world (tptp.mu $$unsorted) Bool)
% 0.18/0.49 (assert (forall ((V $$unsorted)) (exists ((X tptp.mu)) (@ (@ tptp.exists_in_world X) V))))
% 0.18/0.49 (declare-fun tptp.mforall_ind ((-> tptp.mu $$unsorted Bool) $$unsorted) Bool)
% 0.18/0.49 (assert (= tptp.mforall_ind (lambda ((Phi (-> tptp.mu $$unsorted Bool)) (W $$unsorted)) (forall ((X tptp.mu)) (=> (@ (@ tptp.exists_in_world X) W) (@ (@ Phi X) W))))))
% 0.18/0.49 (declare-fun tptp.mexists_ind ((-> tptp.mu $$unsorted Bool) $$unsorted) Bool)
% 0.18/0.49 (assert (= tptp.mexists_ind (lambda ((Phi (-> tptp.mu $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ tptp.mforall_ind (lambda ((X tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ Phi X)) __flatten_var_0)))) __flatten_var_0))))
% 0.18/0.49 (declare-fun tptp.mexists_prop ((-> (-> $$unsorted Bool) $$unsorted Bool) $$unsorted) Bool)
% 0.18/0.49 (assert (= tptp.mexists_prop (lambda ((Phi (-> (-> $$unsorted Bool) $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ tptp.mforall_prop (lambda ((P (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ Phi P)) __flatten_var_0)))) __flatten_var_0))))
% 0.18/0.49 (declare-fun tptp.mreflexive ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.18/0.49 (assert (= tptp.mreflexive (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted)) (@ (@ R S) S)))))
% 0.18/0.49 (declare-fun tptp.msymmetric ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.18/0.49 (assert (= tptp.msymmetric (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted)) (=> (@ (@ R S) T) (@ (@ R T) S))))))
% 0.18/0.49 (declare-fun tptp.mserial ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.18/0.49 (assert (= tptp.mserial (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted)) (exists ((T $$unsorted)) (@ (@ R S) T))))))
% 0.18/0.49 (declare-fun tptp.mtransitive ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.18/0.49 (assert (= tptp.mtransitive (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ (@ R T) U)) (@ _let_1 U)))))))
% 0.18/0.49 (declare-fun tptp.meuclidean ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.18/0.49 (assert (= tptp.meuclidean (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (@ (@ R T) U)))))))
% 0.18/0.49 (declare-fun tptp.mpartially_functional ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.18/0.49 (assert (= tptp.mpartially_functional (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (= T U)))))))
% 0.18/0.49 (declare-fun tptp.mfunctional ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.18/0.49 (assert (= tptp.mfunctional (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted)) (exists ((T $$unsorted)) (and (@ (@ R S) T) (forall ((U $$unsorted)) (=> (@ (@ R S) U) (= T U)))))))))
% 0.18/0.49 (declare-fun tptp.mweakly_dense ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.18/0.49 (assert (= tptp.mweakly_dense (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (=> (@ (@ R S) T) (exists ((U $$unsorted)) (and (@ (@ R S) U) (@ (@ R U) T))))))))
% 0.18/0.49 (declare-fun tptp.mweakly_connected ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.18/0.49 (assert (= tptp.mweakly_connected (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (or (@ (@ R T) U) (= T U) (@ (@ R U) T))))))))
% 0.18/0.49 (declare-fun tptp.mweakly_directed ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.18/0.49 (assert (= tptp.mweakly_directed (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (exists ((V $$unsorted)) (and (@ (@ R T) V) (@ (@ R U) V)))))))))
% 0.18/0.49 (declare-fun tptp.mvalid ((-> $$unsorted Bool)) Bool)
% 0.18/0.49 (assert (= tptp.mvalid (lambda ((Phi (-> $$unsorted Bool))) (forall ((W $$unsorted)) (@ Phi W)))))
% 0.18/0.49 (declare-fun tptp.msatisfiable ((-> $$unsorted Bool)) Bool)
% 0.18/0.49 (assert (= tptp.msatisfiable (lambda ((Phi (-> $$unsorted Bool))) (exists ((W $$unsorted)) (@ Phi W)))))
% 0.18/0.49 (declare-fun tptp.mcountersatisfiable ((-> $$unsorted Bool)) Bool)
% 0.18/0.49 (assert (= tptp.mcountersatisfiable (lambda ((Phi (-> $$unsorted Bool))) (exists ((W $$unsorted)) (not (@ Phi W))))))
% 0.18/0.49 (declare-fun tptp.minvalid ((-> $$unsorted Bool)) Bool)
% 0.18/0.49 (assert (= tptp.minvalid (lambda ((Phi (-> $$unsorted Bool))) (forall ((W $$unsorted)) (not (@ Phi W))))))
% 0.18/0.49 (declare-fun tptp.rel_s4 ($$unsorted $$unsorted) Bool)
% 0.18/0.49 (declare-fun tptp.mbox_s4 ((-> $$unsorted Bool) $$unsorted) Bool)
% 0.18/0.49 (assert (= tptp.mbox_s4 (lambda ((Phi (-> $$unsorted Bool)) (W $$unsorted)) (forall ((V $$unsorted)) (or (not (@ (@ tptp.rel_s4 W) V)) (@ Phi V))))))
% 0.18/0.49 (declare-fun tptp.mdia_s4 ((-> $$unsorted Bool) $$unsorted) Bool)
% 0.18/0.49 (assert (= tptp.mdia_s4 (lambda ((Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ tptp.mbox_s4 (@ tptp.mnot Phi))) __flatten_var_0))))
% 0.18/0.49 (assert (@ tptp.mreflexive tptp.rel_s4))
% 0.18/0.49 (assert (@ tptp.mtransitive tptp.rel_s4))
% 0.18/0.49 (assert (forall ((X tptp.mu) (V $$unsorted) (W $$unsorted)) (let ((_let_1 (@ tptp.exists_in_world X))) (=> (and (@ _let_1 V) (@ (@ tptp.rel_s4 V) W)) (@ _let_1 W)))))
% 0.18/0.49 (declare-fun tptp.sorti2 (tptp.mu $$unsorted) Bool)
% 0.18/0.49 (declare-fun tptp.sorti1 (tptp.mu $$unsorted) Bool)
% 0.18/0.49 (declare-fun tptp.op2 (tptp.mu tptp.mu) tptp.mu)
% 0.18/0.49 (assert (forall ((V $$unsorted) (V2 tptp.mu) (V1 tptp.mu)) (@ (@ tptp.exists_in_world (@ (@ tptp.op2 V2) V1)) V)))
% 0.18/0.49 (declare-fun tptp.op1 (tptp.mu tptp.mu) tptp.mu)
% 0.18/0.49 (assert (forall ((V $$unsorted) (V2 tptp.mu) (V1 tptp.mu)) (@ (@ tptp.exists_in_world (@ (@ tptp.op1 V2) V1)) V)))
% 0.18/0.49 (declare-fun tptp.j (tptp.mu) tptp.mu)
% 0.18/0.49 (assert (forall ((V $$unsorted) (V1 tptp.mu)) (@ (@ tptp.exists_in_world (@ tptp.j V1)) V)))
% 0.18/0.49 (declare-fun tptp.h (tptp.mu) tptp.mu)
% 0.18/0.49 (assert (forall ((V $$unsorted) (V1 tptp.mu)) (@ (@ tptp.exists_in_world (@ tptp.h V1)) V)))
% 0.18/0.49 (assert (@ tptp.mvalid (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((X tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq X) X)) __flatten_var_0))))))
% 0.18/0.49 (assert (@ tptp.mvalid (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((X tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((Y tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq X) Y))) (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq Y) X)))) __flatten_var_0)))) __flatten_var_0))))))
% 0.18/0.49 (assert (@ tptp.mvalid (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((X tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((Y tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((Z tptp.mu) (__flatten_var_0 $$unsorted)) (let ((_let_1 (@ tptp.qmltpeq X))) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ (@ tptp.mand (@ tptp.mbox_s4 (@ _let_1 Y))) (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq Y) Z)))) (@ tptp.mbox_s4 (@ _let_1 Z)))) __flatten_var_0))))) __flatten_var_0)))) __flatten_var_0))))))
% 0.18/0.49 (assert (@ tptp.mvalid (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((A tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((B tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq A) B))) (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq (@ tptp.h A)) (@ tptp.h B))))) __flatten_var_0)))) __flatten_var_0))))))
% 0.18/0.49 (assert (@ tptp.mvalid (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((A tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((B tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq A) B))) (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq (@ tptp.j A)) (@ tptp.j B))))) __flatten_var_0)))) __flatten_var_0))))))
% 0.18/0.49 (assert (@ tptp.mvalid (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((A tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((B tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((C tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq A) B))) (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq (@ (@ tptp.op1 A) C)) (@ (@ tptp.op1 B) C))))) __flatten_var_0)))) __flatten_var_0)))) __flatten_var_0))))))
% 0.18/0.49 (assert (@ tptp.mvalid (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((A tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((B tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((C tptp.mu) (__flatten_var_0 $$unsorted)) (let ((_let_1 (@ tptp.op1 C))) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq A) B))) (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq (@ _let_1 A)) (@ _let_1 B))))) __flatten_var_0))))) __flatten_var_0)))) __flatten_var_0))))))
% 0.18/0.49 (assert (@ tptp.mvalid (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((A tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((B tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((C tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq A) B))) (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq (@ (@ tptp.op2 A) C)) (@ (@ tptp.op2 B) C))))) __flatten_var_0)))) __flatten_var_0)))) __flatten_var_0))))))
% 0.18/0.49 (assert (@ tptp.mvalid (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((A tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((B tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((C tptp.mu) (__flatten_var_0 $$unsorted)) (let ((_let_1 (@ tptp.op2 C))) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq A) B))) (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq (@ _let_1 A)) (@ _let_1 B))))) __flatten_var_0))))) __flatten_var_0)))) __flatten_var_0))))))
% 0.18/0.49 (assert (@ tptp.mvalid (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((A tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((B tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ (@ tptp.mand (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq A) B))) (@ tptp.mbox_s4 (@ tptp.sorti1 A)))) (@ tptp.mbox_s4 (@ tptp.sorti1 B)))) __flatten_var_0)))) __flatten_var_0))))))
% 0.18/0.49 (assert (@ tptp.mvalid (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((A tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((B tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ (@ tptp.mand (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq A) B))) (@ tptp.mbox_s4 (@ tptp.sorti2 A)))) (@ tptp.mbox_s4 (@ tptp.sorti2 B)))) __flatten_var_0)))) __flatten_var_0))))))
% 0.18/0.49 (assert (@ tptp.mvalid (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((U tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ tptp.mbox_s4 (@ tptp.sorti1 U))) (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((V tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ tptp.mbox_s4 (@ tptp.sorti1 V))) (@ tptp.mbox_s4 (@ tptp.sorti1 (@ (@ tptp.op1 U) V))))) __flatten_var_0)))))) __flatten_var_0))))))
% 0.18/0.49 (assert (@ tptp.mvalid (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((U tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ tptp.mbox_s4 (@ tptp.sorti2 U))) (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((V tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ tptp.mbox_s4 (@ tptp.sorti2 V))) (@ tptp.mbox_s4 (@ tptp.sorti2 (@ (@ tptp.op2 U) V))))) __flatten_var_0)))))) __flatten_var_0))))))
% 0.18/0.49 (assert (@ tptp.mvalid (@ tptp.mexists_ind (lambda ((U tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mand (@ tptp.mbox_s4 (@ tptp.sorti1 U))) (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((V tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ tptp.mbox_s4 (@ tptp.sorti1 V))) (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq (@ (@ tptp.op1 V) V)) U)))) __flatten_var_0))))) __flatten_var_0)))))
% 0.18/0.49 (assert (@ tptp.mvalid (@ tptp.mbox_s4 (@ tptp.mnot (@ tptp.mexists_ind (lambda ((U tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mand (@ tptp.mbox_s4 (@ tptp.sorti2 U))) (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((V tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ tptp.mbox_s4 (@ tptp.sorti2 V))) (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq (@ (@ tptp.op2 V) V)) U)))) __flatten_var_0))))) __flatten_var_0)))))))
% 0.18/0.49 (assert (not (@ tptp.mvalid (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ (@ tptp.mand (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((U tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ tptp.mbox_s4 (@ tptp.sorti1 U))) (@ tptp.mbox_s4 (@ tptp.sorti2 (@ tptp.h U))))) __flatten_var_0))))) (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((V tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ tptp.mbox_s4 (@ tptp.sorti2 V))) (@ tptp.mbox_s4 (@ tptp.sorti1 (@ tptp.j V))))) __flatten_var_0)))))) (@ tptp.mbox_s4 (@ tptp.mnot (@ (@ tptp.mand (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((W tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ tptp.mbox_s4 (@ tptp.sorti1 W))) (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((X tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ tptp.mbox_s4 (@ tptp.sorti1 X))) (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq (@ tptp.h (@ (@ tptp.op1 W) X))) (@ (@ tptp.op2 (@ tptp.h W)) (@ tptp.h X)))))) __flatten_var_0)))))) __flatten_var_0))))) (@ (@ tptp.mand (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((Y tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ tptp.mbox_s4 (@ tptp.sorti2 Y))) (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((Z tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ tptp.mbox_s4 (@ tptp.sorti2 Z))) (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq (@ tptp.j (@ (@ tptp.op2 Y) Z))) (@ (@ tptp.op1 (@ tptp.j Y)) (@ tptp.j Z)))))) __flatten_var_0)))))) __flatten_var_0))))) (@ (@ tptp.mand (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((X1 tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ tptp.mbox_s4 (@ tptp.sorti2 X1))) (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq (@ tptp.h (@ tptp.j X1))) X1)))) __flatten_var_0))))) (@ tptp.mbox_s4 (@ tptp.mforall_ind (lambda ((X2 tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mbox_s4 (@ (@ tptp.mimplies (@ tptp.mbox_s4 (@ tptp.sorti1 X2))) (@ tptp.mbox_s4 (@ (@ tptp.qmltpeq (@ tptp.j (@ tptp.h X2))) X2)))) __flatten_var_0))))))))))))))
% 0.18/0.49 (set-info :filename cvc5---1.0.5_2518)
% 0.18/0.49 (c/export/starexec/sandbox2/solver/bin/do_THM_THF: line 35: 9168 Alarm clock ( read result; case "$result" in
% 299.82/300.06 unsat)
% 299.82/300.06 echo "% SZS status $unsatResult for $tptpfilename"; echo "% SZS output start Proof for $tptpfilename"; cat; echo "% SZS output end Proof for $tptpfilename"; exit 0
% 299.82/300.06 ;;
% 299.82/300.06 sat)
% 299.82/300.06 echo "% SZS status $satResult for $tptpfilename"; cat; exit 0
% 299.82/300.06 ;;
% 299.82/300.06 esac; exit 1 )
% 299.82/300.07 heck-sat-assuming ( true ))
% 299.82/300.07 ------- get file name : TPTP file name is ALG018^7
% 299.82/300.07 ------- cvc5-thf : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_2518.smt2...
% 299.82/300.07 --- Run --ho-elim --full-saturate-quant at 10...
% 299.82/300.07 --- Run --ho-elim --no-e-matching --full-saturate-quant at 10...
% 299.82/300.07 --- Run --ho-elim --no-e-matching --enum-inst-sum --full-saturate-quant at 10...
% 299.82/300.07 --- Run --ho-elim --finite-model-find --uf-ss=no-minimal at 5...
% 299.82/300.07 --- Run --no-ho-matching --finite-model-find --uf-ss=no-minimal at 5...
% 299.82/300.07 --- Run --no-ho-matching --full-saturate-quant --enum-inst-interleave --ho-elim-store-ax at 10...
% 299.82/300.07 --- Run --no-ho-matching --full-saturate-quant --macros-quant-mode=all at 10...
% 299.82/300.07 --- Run --ho-elim --full-saturate-quant --enum-inst-interleave at 10...
% 299.82/300.07 --- Run --no-ho-matching --full-saturate-quant --ho-elim-store-ax at 10...
% 299.82/300.07 --- Run --ho-elim --no-ho-elim-store-ax --full-saturate-quant...
% 299.82/300.07 % cvc5---1.0.5 exiting
% 299.82/300.07 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------